Electronic Companion A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering
نویسندگان
چکیده
where the second equality holds because of the change of measure with dP̃ dP |Ft = e Xt−rt. Because St has a continuous distribution under both P and P̃ , then f1(k) and f2(k) are in C. Besides, P̃ ( St ≥ e−k ) and P ( St ≥ e−k ) are both increasing in k. Therefore, applying Lemma 3.1 yields that both f1(k) and f2(k) satisfy Assumption 1. Note that for any σ ∈ (−1,−σl − 1), ∫ +∞ −∞ ef2(k)dk =e −rt ∫ +∞ −∞ e−(σ+1)kP ( St ≥ e−k ) dk
منابع مشابه
A Two-sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering
Transform-based algorithms have wide applications in applied probability, but rarely provide computable error bounds to guarantee the accuracy. We propose an inversion algorithm for two-sidedLaplace transformswith computable error bounds. The algorithm involves a discretization parameter C and a truncation parameter N . By choosing C and N using the error bounds, the algorithm can achieve any d...
متن کاملGuaranteed lower bounds for eigenvalues
This paper introduces fully computable two-sided bounds on the eigenvalues of the Laplace operator on arbitrarily coarse meshes based on some approximation of the corresponding eigenfunction in the nonconforming Crouzeix-Raviart finite element space plus some postprocessing. The efficiency of the guaranteed error bounds involves the global mesh-size and is proven for the large class of graded m...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملAutomatic Bounding Estimation in Modified Nlms Algorithm
Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...
متن کاملA Multi-objective Mixed Model Two-sided Assembly Line Sequencing Problem in a Make –To- Order Environment with Customer Order Prioritization
Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...
متن کامل